Combinatorics of Finitely Generated Groups

نویسندگان

  • Anton Sergeevich Malyshev
  • Rafail Ostrovsky
  • Ciprian Manolescu
  • Eli Gafni
  • Igor Pak
چکیده

of the Dissertation Combinatorics of Finitely Generated Groups

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MULTIPLICATION MODULES THAT ARE FINITELY GENERATED

Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. An $R$-module $M$ is called a multiplication module if for every submodule $N$ of $M$ there exists an ideal $I$ of $R$ such that $N = IM$. It is shown that over a Noetherian domain $R$ with dim$(R)leq 1$, multiplication modules are precisely cyclic or isomorphic to an invertible ideal of $R$. Moreover, we give a charac...

متن کامل

On the genericity of Whitehead minimality

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in free groups. The proofs strongly rely on combinatorial tools, notably those of analytic combinatorics. The result we prove actually depends implicitly on the ch...

متن کامل

A characterization of finitely generated multiplication modules

 Let $R$ be a commutative ring with identity and $M$ be a finitely generated unital $R$-module. In this paper, first we give necessary and sufficient conditions that a finitely generated module to be a multiplication module. Moreover, we investigate some conditions which imply that the module $M$ is the direct sum of some cyclic modules and free modules. Then some properties of Fitting ideals o...

متن کامل

Church-Rosser Groups and Growing Context-Sensitive Groups

A finitely generated group is called a Church-Rosser group (growing contextsensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the ChurchRosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free language...

متن کامل

Finitely Generated Annihilating-Ideal Graph of Commutative Rings

Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014